import java.util.Scanner;


public class Bruchrechnen {
	
	public static void main(String[] args) 
	{
		int[] fraction1 = new int[] { (int) (5 * Math.pow(2, 21)) , (int) (3 * Math.pow(2, 20)) };
		int[] fraction2 = new int[] {  (int) (6 * Math.pow(2, 21)) , (int) (4 * Math.pow(2, 20)) };
		int[] fraction3 = new int[] { 10 , 11 };
		
		int[] fraction4 = mult(fraction1, fraction2);
		fraction4 = add(fraction3, fraction3);
		System.out.println(getReal(fraction4));
	}
	
	public static int[] expand(int[] fraction, int expandNumber)
	{
		fraction[0] *= expandNumber;
		fraction[1] *= expandNumber;
		
		return fraction;
	}

	public static int[] reduce(int[] fraction)
	{
		int ggt = calcGGT(fraction);
		
		fraction[0] /= ggt;
		fraction[1] /= ggt;
		
		return fraction;
	}
	
	public static int[] add(int[] fraction1, int[] fraction2)
	{
		fraction1 = reduce(fraction1);
		fraction2 = reduce(fraction2);
		
		int[] fraction3 = new int[2];
		fraction3[1] = fraction1[0] * fraction2[1] + fraction1[0] * fraction2[1]; //Zaehler
		fraction3[0] = fraction1[0] * fraction2[0]; //Nenner
		
		return reduce(fraction3);
	}
	
	public static int[] mult(int[] fraction1, int[] fraction2)
	{
		fraction1 = reduce(fraction1);
		fraction2 = reduce(fraction2);
		
		int[] fraction3 = new int[2];
		fraction3[1] = fraction1[1] * fraction2[1]; //Zaehler
		fraction3[0] = fraction1[0] * fraction2[0]; //Nenner
		
		return reduce(fraction3);
	}
	
	public static boolean equals(int[] fraction1, int[] fraction2)
	{
		fraction1 = reduce(fraction1);
		fraction2 = reduce(fraction2);
		
		return fraction1[0] == fraction2[0] && fraction1[1] == fraction2[1];	
	}
	
	public static double getReal(int[] fraction)
	{
		return fraction[1] / fraction[0];
	}
	
	public static int calcGGT(int[] fraction)
	{
		int firstNumber = Math.abs(fraction[0]);
		int secondNumber = Math.abs(fraction[1]);
		
		int counter = 0;
		while(firstNumber != 0 && secondNumber != 0)
		{
			if(firstNumber % 2 == 0 && secondNumber % 2 == 0)
			{
				firstNumber /= 2;
				secondNumber /= 2;
				counter++;
			}
			else if(firstNumber % 2 == 0)
			{
				firstNumber /= 2;
			}
			else if(secondNumber % 2 == 0)
			{
				secondNumber /= 2;
			}
			else
			{
				if(firstNumber > secondNumber)
					firstNumber = (int) ((firstNumber - secondNumber) / 2);
				else
					secondNumber = (int) ((secondNumber - firstNumber) / 2);
			}
		}
		
		return (int) (firstNumber != 0 
				? firstNumber * Math.pow(2, counter)
				: secondNumber * Math.pow(2, counter));
	
	}
}
